Tie-Breaking Semantics and Structural Totality
نویسندگان
چکیده
منابع مشابه
Tie-Breaking for Curve Multiclassifiers
Many practical problems reduce to classifying curves among multiple classes, for example on-line recognition of handwritten mathematical symbols. By treating a curve as an algebraic object and computing truncated expansions of its parametric coordinate functions in an orthogonal functional basis, we obtain an accurate, compact, and geometrically intuitive representation of the curve as a point ...
متن کاملNash implementation and tie-breaking rules
I study Nash implementation when agents might use a tie-breaking rule to choose among the messages they are materially indifferent between. If the planner is endowed with the knowledge of the rule, this might expand or shrink the set of implementable social choice correspondences (SCC) depending on the particular rule used by the agents. The effect might be considerable. For instance, there exi...
متن کاملManipulation with randomized tie-breaking under Maximin
In recent papers, Obraztsova et al. initiated the study of the computational complexity of voting manipulation under randomized tie-breaking [3, 2]. The authors provided a polynomial-time algorithm for the problem of finding an optimal vote for the manipulator (a vote maximizing the manipulator’s expected utility) under the Maximin voting rule, for the case where the manipulator’s utilities of ...
متن کاملRandom Tie-breaking with Stochastic Dominance
Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under stochastic dominance.
متن کاملTie-breaking for EDF on multiprocessor platforms
Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. When scheduling using EDF on multiprocessor platforms, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in EDF priorities due to coincident deadlines. We show that no optimal ambiguity solver ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1451